Necessary and Sufficient Numbers of Cards for Sharing Secret Keys on Hierarchical Groups
نویسندگان
چکیده
Suppose that there are players in two hierarchical groups and a computationally unlimited eavesdropper. Using a random deal of cards, a player in the higher group wishes to send a one-bit message information-theoretically securely either to all the players in her group or to all the players in the two groups. This can be done by the so-called 2-level key set protocol. In this paper we give a necessary and sufficient condition for the 2-level key set protocol to succeed. key words: card game, key exchange graph, key set protocol, secret key exchange, tree
منابع مشابه
Algorithms for multi-secret hierarchical sharing schemes of shamir type
In this paper there are presented algorithms for multilevel hierarchical threshold secret sharing schemes based on the interpolation of Hermite type, which use either traditional Shamir’s keys or polynomial and orthogonal polynomial keys. These algorithms enable to compute the probability of authenticity of shares during the process of recovering the keys. In addition, two models of secret shar...
متن کاملNecessary and Sufficient Numbers of Cards for the Transformation Protocol
The transformation protocol can make two players share a secret key using a random deal of cards. A sufficient condition on the number of cards for the transformation protocol to succeed was known. However, it has been an open problem to obtain a necessary and sufficient condition. This paper improves the transformation protocol and gives a necessary and sufficient condition for the improved tr...
متن کاملAn Efficient Secure Key Management Scheme based on Secret Sharing for Hierarchical Wireless Sensor Networks
Wireless sensor networks (WSNs) have acquired a lot of interest due to huge number of applications. If WSNs are deployed in inimical ambience, the nature of sensor nodes must be considered such as the limitation of memory resources, low computation ability, short communication range and energy constraints. So that it is necessary to use an efficient and secure key management scheme to avoid the...
متن کاملStrongly Multiplicative Hierarchical Threshold Secret Sharing
We consider multi-party computation (MPC) in a hierarchical setting, where participants have different capabilities depending on their position in the hierarchy. First, we give necessary conditions for multiplication of secrets in a hierarchical threshold linear secret sharing scheme (LSSS). Starting with known ideal constructions, we then propose a modified scheme with improved multiplication ...
متن کاملLinear threshold verifiable secret sharing in bilinear groups
In many pairing-based cryptosystems, the secret keys are elements of bilinear groups. For safeguarding such secret keys or decrypting or signing in a threshold manner, Verifiable Secret Sharing (VSS) in bilinear groups is required. In this paper, we show a method of verifiably sharing a random secret in a bilinear group. Our method is simple and practical. It can be regarded as a generalisation...
متن کامل